全文获取类型
收费全文 | 5122篇 |
免费 | 285篇 |
国内免费 | 442篇 |
专业分类
化学 | 352篇 |
晶体学 | 2篇 |
力学 | 250篇 |
综合类 | 95篇 |
数学 | 4326篇 |
物理学 | 824篇 |
出版年
2024年 | 6篇 |
2023年 | 78篇 |
2022年 | 82篇 |
2021年 | 100篇 |
2020年 | 142篇 |
2019年 | 135篇 |
2018年 | 144篇 |
2017年 | 134篇 |
2016年 | 133篇 |
2015年 | 96篇 |
2014年 | 234篇 |
2013年 | 547篇 |
2012年 | 204篇 |
2011年 | 278篇 |
2010年 | 263篇 |
2009年 | 343篇 |
2008年 | 356篇 |
2007年 | 337篇 |
2006年 | 294篇 |
2005年 | 291篇 |
2004年 | 215篇 |
2003年 | 198篇 |
2002年 | 198篇 |
2001年 | 136篇 |
2000年 | 137篇 |
1999年 | 137篇 |
1998年 | 114篇 |
1997年 | 83篇 |
1996年 | 78篇 |
1995年 | 64篇 |
1994年 | 55篇 |
1993年 | 40篇 |
1992年 | 24篇 |
1991年 | 16篇 |
1990年 | 18篇 |
1989年 | 9篇 |
1988年 | 11篇 |
1987年 | 17篇 |
1986年 | 24篇 |
1985年 | 19篇 |
1984年 | 8篇 |
1983年 | 12篇 |
1982年 | 11篇 |
1981年 | 9篇 |
1980年 | 3篇 |
1978年 | 4篇 |
1973年 | 2篇 |
1970年 | 2篇 |
1969年 | 1篇 |
1957年 | 3篇 |
排序方式: 共有5849条查询结果,搜索用时 156 毫秒
61.
Norman Biggs 《Journal of Combinatorial Theory, Series B》2004,92(2):359
An explicit formula for the chromatic polynomials of certain families of graphs, called bracelets', is obtained. The terms correspond to irreducible representations of symmetric groups. The theory is developed using the standard bases for the Specht modules of representation theory, and leads to an effective means of calculation. 相似文献
62.
Richard Arratia Bla Bollobs Gregory B. Sorkin 《Journal of Combinatorial Theory, Series B》2004,92(2):199-233
Motivated by circle graphs, and the enumeration of Euler circuits, we define a one-variable “interlace polynomial” for any graph. The polynomial satisfies a beautiful and unexpected reduction relation, quite different from the cut and fuse reduction characterizing the Tutte polynomial.It emerges that the interlace graph polynomial may be viewed as a special case of the Martin polynomial of an isotropic system, which underlies its connections with the circuit partition polynomial and the Kauffman brackets of a link diagram. The graph polynomial, in addition to being perhaps more broadly accessible than the Martin polynomial for isotropic systems, also has a two-variable generalization that is unknown for the Martin polynomial. We consider extremal properties of the interlace polynomial, its values for various special graphs, and evaluations which relate to basic graph properties such as the component and independence numbers. 相似文献
63.
Ioan Tomescu 《Journal of Graph Theory》2003,43(3):210-222
In the set of graphs of order n and chromatic number k the following partial order relation is defined. One says that a graph G is less than a graph H if ci(G) ≤ ci(H) holds for every i, k ≤ i ≤ n and at least one inequality is strict, where ci(G) denotes the number of i‐color partitions of G. In this paper the first ? n/2 ? levels of the diagram of the partially ordered set of connected 3‐chromatic graphs of order n are described. © 2003 Wiley Periodicals, Inc. J Graph Theory 43: 210–222, 2003 相似文献
64.
Summary By employing a novel idea and simple techniques, we substantially generalize the Turán type inequality for rational functions
with real zeros and prescribed poles established by Min [5] to include Lpspaces for 1≤p≤∞<span style='font-size:10.0pt'>while loosing the restriction ρ > 2 at the same time. 相似文献
65.
SINGLE MACHINE SCHEDULING WITH CONTROLLABLE PROCESSING TIMES AND COMPRESSION COSTS (PART I:EQUAL TIMES AND COSTS) 总被引:1,自引:0,他引:1
Most papers in scheduling research have treated individual job processing times as fixed parameters. However, in many practical situations, a manager may control processing time by realloeating resources. In this paper, authors consider a machine scheduling problemwith controllable processing times. In the first part of this paper, a special case where the pro-cessing times and compression costs are uniform among jobs is discussed. Theoretical results are derived that aid in developing an O(n^2) algorithm to slove the problem optimally. In the second part of this paper, authors generalize the discussion to general case, An effective heuristic to the genera/ problem will be presented. 相似文献
66.
卢琳璋 《高等学校计算数学学报(英文版)》1994,(1)
The unit circle problem is the problem of finding the number of eigenvalues of a non-Hermitian matrix inside and outside the unit circle . To reduce the cost of computing eigenvalues for the problem, a direct method, which is analogous to that given in [5], is proposed in this paper. 相似文献
67.
Numerous versions of the Lanczos τ-methods have been extensively used to produce polynomial approximations for functions verifying
a linear differential equation with polynomial coefficients. In the case of an initial-value problem, an adapted τ-method
based on Chebyshev series and the use of symbolic computation lead to a rational approximation of the solution on a region
of the complex plane. Numerical examples show that the simplicity of the method does not prevent a high accuracy of results.
This revised version was published online in June 2006 with corrections to the Cover Date. 相似文献
68.
Lufthansa Technical Training GmbH (LTT) performs training courses for Lufthansa Technik AG as well as for several other international airlines. Courses of about 670 different types are offered of which several hundred take place each year. The course scheduling problem faced by LTT is to construct a yearly schedule which maximizes the profit margin incurred while meeting a variety of complex precedence, temporal, and resource-related constraints. A “good” operational schedule should also meet a number of additional subordinate objectives. We formalize the problem and develop a heuristic scheme along with several priority rules, as well as a local search algorithm to determine well-suited weights for weighted composite rules. The operational planning situation of 1996 served as our major test instance; additional test instances were constructed by modifying this data. Several computational experiments were carried out to evaluate the performance of the algorithms. It turned out that the best so-found schedule is substantially better in terms of the profit margin incurred than the solution manually constructed by LTT. 相似文献
69.
研究了谐和激励下含有界随机参数Duffing系统(简称随机Duffing系统)中的随机混沌及其延迟反馈控制问题.借助Gegenbauer多项式逼近理论,将随机Duffing系统转化为与其等效的确定性非线性系统.这样,随机Duffing系统在谐和激励下的混沌响应及其控制问题就可借等效的确定性非线性系统来研究.分析阐明了随机混沌的主要特点,并采用Wolf算法计算等效确定性非线性系统的最大Lyapunov指数,以判别随机Duffing系统的动力学行为.数值计算表明,恰当选取不同的反馈强度和延迟时间,可分别达到抑制或诱发系统混沌的目的,说明延迟反馈技术对随机混沌控制也是十分有效的.
关键词:
随机Duffing系统
延迟反馈控制
随机混沌
Gegenbauer多项式 相似文献
70.
In this paper we face the problem of stowing a containership, referred to as the Master Bay Plan Problem (MBPP); this problem
is difficult to solve due to its combinatorial nature and the constraints related to both the ship and the containers. We
present a decomposition approach that allows us to assign a priori the bays of a containership to the set of containers to
be loaded according to their final destination, such that different portions of the ship are independently considered for
the stowage. Then, we find the optimal solution of each subset of bays by using a 0/1 Linear Programming model. Finally, we
check the global ship stability of the overall stowage plan and look for its feasibility by using an exchange algorithm which
is based on local search techniques. The validation of the proposed approach is performed with some real life test cases.
This work has been developed within the research area: “The harbour as a logistic node” of the Italian Centre of Excellence
on Integrated Logistics (CIELI) of the University of Genoa, Italy 相似文献